Test Series - Data Structure

3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117

Test Number 72/115

Q: Which of the following is false?
A. A B+ -tree grows downwards
B. A B+ -tree is balanced
C. In a B+ -tree, the sibling pointers allow sequential searching
D. B+ -tree is shallower than B-tree
Solution: A B+ -tree always grows upwards. And In a B+tree – i)The path from the root to every leaf node is of the same length, so the tree is balanced. ii) Leaves are linked, so allow sequential searching. iii) An index is built with a single key per block of data rather than with one key per data record, so it is shallower than B-tree.
Q: A B+ tree can contain a maximum of 7 pointers in a node. What is the minimum number of keys in leaves?
A. 6
B. 3
C. 4
D. 7
Solution: Maximum number of pointers in a node is 7, i.e. the order of the B+ -tree is 7. In a B+ tree of order n each leaf node contains at most n – 1 key and at least ⌈(n − 1)/2⌉ keys. Therefore, a minimum number of keys each leaf can have = ⌈(7 – 1)/2⌉ = 3.
Q: Which of the following is true?
A. B + tree allows only the rapid random access
B. B + tree allows only the rapid sequential access
C. B + tree allows rapid random access as well as rapid sequential access
D. B + tree allows rapid random access and slower sequential access
Solution: The B+ -tree being a variation of B-tree allows rapid random access. In a B+ -tree the leaves are linked together, so it also provides rapid sequential access.
Q: Statement 1: When a node is split during insertion, the middle key is promoted to the parent as well as retained in right half-node.
Statement 2: When a key is deleted from the leaf, it is also deleted from the non-leaf nodes of the tree.
A. Statement 1 is true but statement 2 is false
B. Statement 2 is true but statement 1 is false
C. Both the statements are true
D. Both the statements are false
Solution: During the split, the middle key is retained in the right half node and also promoted to parent node. When a key is deleted from the leaf, it is retained in non-leaves, because it can be still a valid separator between keys in nodes below.
Q: Efficiency of finding the next record in B+ tree is ____
A. O(n)
B. O(log n)
C. O(nlog n)
D. O(1)
Solution: In a B+ -tree finding the next recored (successor) involves accessing an additional leaf at most. So, the efficiency of finding the next record is O(1).
Q: What is the maximum number of keys that a B+ -tree of order 3 and of height 3 have?
A. 3
B. 80
C. 27
D. 26
Solution: A B+ tree of order n and height h can have at most nh – 1 keys. Therefore maximum number of keys = 33 -1 = 27 -1 = 26.
Q: Which of the following is false?
A. Compared to B-tree, B+ -tree has larger fanout
B. Deletion in B-tree is more complicated than in B+ -tree
C. B+ -tree has greater depth than corresponding B-tree
D. Both B-tree and B+ -tree have same search and insertion efficiencies
Solution: A B+ -tree has larger fanout and therefore have a depth smaller than that of corresponding B-tree.
Q: Which one of the following data structures are preferred in database-system implementation?
A. AVL tree
B. B-tree
C. B+ -tree
D. Splay tree
Solution: The database-system implementations use B+ -tree data structure because they can be used for multilevel indexing.

You Have Score    /8